Quantum algorithm for distributed clock synchronization

نویسنده

  • Chuang
چکیده

The clock synchronization problem is to determine the time difference Delta between two spatially separated clocks. When message delivery times between the two clocks are uncertain, O(2(2n)) classical messages must be exchanged between the clocks to determine n digits of Delta. On the other hand, as we show, there exists a quantum algorithm to obtain n digits of Delta while communicating only O(n) quantum messages.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lorentz-invariant look at quantum clock-synchronization protocols based on distributed entanglement

Recent work has raised the possibility that quantum-information-theory techniques can be used to synchronize atomic clocks nonlocally. One of the proposed algorithms for quantum clock synchronization ~QCS! requires distribution of entangled pure singlets to the synchronizing parties @R. Jozsa et al., Phys. Rev. Lett. 85 2010 ~2000!#. Such remote entanglement distribution normally creates a rela...

متن کامل

Quantum Clock Synchronization with one qubit

The clock synchronization problem is to determine the time difference T between two spatially separated parties. We improve on I. Chuang’s quantum clock synchronization algorithm and show that it is possible to obtain T to n bits of accuracy while communicating only one qubit in one direction and using an O(2) frequency range. We also prove a quantum lower bound of Ω(2) for the product of the t...

متن کامل

Linear Time Byzantine Self-Stabilizing Clock Synchronization

Awareness of the need for robustness in distributed systems increases as distributed systems become an integral part of day-to-day systems. Tolerating Byzantine faults and possessing self-stabilizing features are sensible and important requirements of distributed systems in general, and of a fundamental task such as clock synchronization in particular. There are efficient solutions for Byzantin...

متن کامل

Linear-time Self-stabilizing Byzantine Clock Synchronization

Clock synchronization is a very fundamental task in distributed system. It thus makes sense to require an underlying clock synchronization mechanism to be highly fault-tolerant. A self-stabilizing algorithm seeks to attain synchronization once lost; a Byzantine algorithm assumes synchronization is never lost and focuses on containing the influence of the permanent presence of faulty nodes. Ther...

متن کامل

Fault-tolerant Clock Synchronization for Distributed Systems with High Message Delay Variation

Fault-tolerant clock synchronization is an important requirement in many distributed systems , especially in time-critical and safety-critical applications. Frequently, interactive convergence algorithms are used for fault-tolerant clock synchronization, providing advantages such as fully distributed operation, low message exchange overhead, and simplicity of implementation. This paper presents...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review letters

دوره 85 9  شماره 

صفحات  -

تاریخ انتشار 2000